Optimal Distance Labeling for Interval Graphs and Related Graph Families
نویسندگان
چکیده
منابع مشابه
Optimal Distance Labeling for Interval Graphs and Related Graph Families
A distance labeling scheme is a distributed graph representation that assigns labels to the vertices and enables answering distance queries between any pair (x, y) of vertices by using only the labels of x and y. This paper presents an optimal distance labeling scheme with labels of O(logn) bits for the n-vertex interval graphs family. It improves by log n factor the best known upper bound of [...
متن کاملOptimal distance labeling for interval graphs and related graphs families∗
A distance labeling scheme is a distributed graph representation that assigns labels to the vertices and enables to answer distance queries between any pair (x, y) of vertices by using only the labels of x and y. This paper presents an optimal distance labeling scheme with labels of O(log n) bits for the n-vertex interval graphs family. It improves by log n factor the best known upper bound of ...
متن کاملDistance Labeling for Permutation Graphs
We show that every permutation graph with n elements can be preprocessed in O(n) time, if two linear extensions of the corresponding poset are given, to produce an O(n) space data-structure supporting distance queries in constant time. The datastructure is localized and given as a distance labeling, that is each vertex receives a label of O(log n) bits so that distance queries between any two v...
متن کامل$Z_k$-Magic Labeling of Some Families of Graphs
For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$ the group of integers modulo $k...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2008
ISSN: 0895-4801,1095-7146
DOI: 10.1137/050635006